Plausible Description Logic Programs for Stream Reasoning

نویسندگان

  • Adrian Groza
  • Ioan Alfred Letia
چکیده

Sensor networks are estimated to drive the formation of the future Internet, with stream reasoning responsible for analysing sensor data. Stream reasoning is defined as real time logical reasoning on large, noisy, heterogeneous data streams, aiming to support the decision process of large numbers of concurrent querying agents. In this research we exploited non-monotonic rule-based systems for handling inconsistent or incomplete information and also ontologies to deal with heterogeneity. Data is aggregated from distributed streams in real time and plausible rules fire when new data is available. The advantages of lazy evaluation on data streams were investigated in this study, with the help of a prototype developed in Haskell.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automating Defeasible Reasoning with Logic Programming (DeReLoP)

This is a description of the DeReLoP project between the Artificial Intelligence groups at the University of Koblenz, Germany and the Universidad Nacional del Sur, Bahia Blanca, Argentina. The overall idea is to try to combine the theoretical and practical work done in Bahia Blanca and Koblenz and make it confluent. Both groups are working in the broad area of knowledge representation and on ap...

متن کامل

Nonmonotonic Description Logic Programs: Implementation and Experiments

The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced methods and algorithms. Recently, several notions of description logic programs have been introduced, combining rule-based semantics with description logics. Among them are nonmonotonic description logic programs (or dl-progra...

متن کامل

Ontological Stream Reasoning via Syntactic Approximation

Traditionally Description Logic (DL)-based ontologies are only used to capture static knowledge. Recently the fast development of the Semantic Web and its evolving data raises the requirements of reasoning services on dynamic knowledge streams. In this paper, we present an efficient ontology stream reasoning approach which combines the delete and re-derive algorithm and the syntactic approximat...

متن کامل

Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web∗

We present a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic...

متن کامل

Extending Conceptual Logic Programs with Arbitrary Rules

We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Future Internet

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012